Translating the Japanese Presupposed Ultimate Fact Theory into Logic Programming
نویسندگان
چکیده
The Japanese “theory of presupposed ultimate facts” (called “Yokenjijitsu-ron” in Japanese) for interpreting the Japanese civil code has been underway for over forty years mainly by judges in the Japanese Legal Training Institute, but not yet formalized in a mathematical way. This paper attempts to mathematically formalize this theory and presents the correspondence between the theory and logic programming with “negation as failure”. It is quite surprising that Japanese judges independently developed such a theory without knowing about logic programming.
منابع مشابه
PROLEG: An Implementation of the Presupposed Ultimate Fact Theory of Japanese Civil Code by PROLOG Technology
In this paper, we propose a legal reasoning system called PROLEG (PROlog based LEGal reasoning support system) based on the Japanese “theory of presupposed ultimate facts” (called “Yokenjijitsu-ron” in Japanese, the JUF theory, in short). The theory is used for decision making by judges under incomplete information. Previously, we proposed a translation of the theory into logic programming. How...
متن کاملUltimate Approximations in Nonmonotonic Knowledge Representation Systems
We study fixpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We show that each lattice operator O has a unique most precise or ultimate approximation. We demonstrate that fixpoints of this ultimate approximation provide useful insights into fixpoints of the operator O. We apply our ...
متن کاملA New Algorithm for Determining Ultimate Pit Limits Based on Network Optimization
One of the main concerns of the mining industry is to determine ultimate pit limits. Final pit is a collection of blocks, which can be removed with maximum profit while following restrictions on the slope of the mine’s walls. The size, location and final shape of an open-pit are very important in designing the location of waste dumps, stockpiles, processing plants, access roads and other surfac...
متن کاملRelating Defeasible Logic to the Well-Founded Semantics for Normal Logic Programs
The most recent version of defeasible logic (Nute 1997) is related to the well-founded semantics by translating defeasible theories into normal logic programs. A correspondence is shown between the assertions of a defeasible theory and the literals contained in the well-founded model of the translation. The translation scheme is based upon (Antoniou & Maher 2002) but is modified to account for ...
متن کاملA Chance Constrained Multiple Objective Goal Programming Model of Fuzzy QFD and FMEA: Model Development
There are varieties of QFD combination forms available that can help management to choose the right model for his/her types of problem. The proposed MOCC-QFD-FMEA model is a right model to include variety of objectives as well as the risk factors into the model of the problem. Due to the fact that the model also takes into consideration the concept of Fuzzy set, it further allows management...
متن کامل